Full-splitting Miller trees and infinitely often equal reals
نویسندگان
چکیده
Article history: Received 28 August 2015 Accepted 6 February 2017 Available online 16 February 2017 MSC: 03E15 03E17 03E35 03E75
منابع مشابه
The K-Degrees, Low for K Degrees, and Weakly Low for K Sets
We call A weakly low for K if there is a c such that KA(σ) ≥ K(σ)−c for infinitely many σ; in other words, there are infinitely many strings that A does not help compress. We prove that A is weakly low for K iff Chaitin’s Ω is A-random. This has consequences in the K-degrees and the low for K (i.e., low for random) degrees. Furthermore, we prove that the initial segment prefix-free complexity o...
متن کاملEvery 2-random real is Kolmogorov random
We study reals with infinitely many incompressible prefixes. Call A ∈ 2 Kolmogorov random if (∃∞n) C(A n) > n − O(1), where C denotes plain Kolmogorov complexity. This property was suggested by Loveland and studied by Martin-Löf, Schnorr and Solovay. We prove that 2-random reals are Kolmogorov random.1 Together with the converse—proved by Nies, Stephan and Terwijn [11]—this provides a natural c...
متن کاملCreature forcing and large continuum: the joy of halving
A. For f , g ∈ ω let c∀f ,g be the minimal number of uniform g-splitting trees needed to cover the uniform f -splitting tree, i.e., for every branch ν of the f -tree, one of the g-trees contains ν. Let c∃f ,g be the dual notion: For every branch ν, one of the g-trees guesses ν(m) infinitely often. We show that it is consistent that c∃fǫ ,gǫ = c ∀ fǫ ,gǫ = κǫ for continuum many pairwise d...
متن کاملGeneralized Silver and Miller measurability
1 We present some results about the burgeoning research area concerning set theory of the “κ-reals”. We focus on some notions of measurability coming from generalizations of Silver and Miller trees. We present analogies and mostly differences from the classical setting.
متن کاملAsymptotic Cost of Cutting Down Random Free Trees
In this work, we calculate the limit distribution of the total cost incurred by splitting a tree selected at random from the set of all finite free trees. This total cost is considered to be an additive functional induced by a toll equal to the square of the size of tree. The main tools used are the recent results connecting the asymptotics of generating functions with the asymptotics of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 168 شماره
صفحات -
تاریخ انتشار 2017